Factorization of multivariate positive Laurent polynomials
نویسندگان
چکیده
Recently Dritschel proves that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another proof of the Dritschel theorem. Our proof is based on the univariate matrix Féjer-Riesz theorem. Then we discuss a computational method to find approximates of polynomial matrix factorization. Some numerical examples will be shown. Finally we discuss how to compute nonnegative Laurent polynomial factorizations in the multivariate setting. §
منابع مشابه
Multivariate Positive Laurent Polynomials
Recently Dritschel proves that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another proof of the Dritschel theorem. Our proof is based on the univariate matrix Féjer-Riesz theorem. Then we discuss a computational method to find approximates of polynomial matrix factorization. Some numerical examples will be shown. F...
متن کاملMultivariate Orthogonal Laurent Polynomials and Integrable Systems
An ordering for Laurent polynomials in the algebraic torus (C∗)D, inspired by the Cantero–Moral– Velázquez approach to orthogonal Laurent polynomials in the unit circle, leads to the construction of a moment matrix for a given Borel measure in the unit torus T. The Gauss–Borel factorization of this moment matrix allows for the construction of multivariate biorthogonal Laurent polynomials in the...
متن کاملcient Multivariate Factorization Over
We describe the Maple 23] implementation of multivariate factorization over general nite elds. Our rst implementation is available in Maple V Release 3. We give selected details of the algorithms and show several ideas that were used to improve its eeciency. Most of the improvements presented here are incorporated in Maple V Release 4. In particular, we show that we needed a general tool for im...
متن کاملEfficient Multivariate Factorization over Finite Fields
We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected details of the algorithms and show several ideas that were used to improve its efficiency. Most of the improvements presented here are incorporated in Maple V Release 4. In particular, we show that we needed a general to...
متن کاملAlgorithms for the Functional Decomposition of Laurent Polynomials
Recent work has detailed the conditions under which univariate Laurent polynomials have functional decompositions. This paper presents algorithms to compute such univariate Laurent polynomial decompositions efficiently and gives their multivariate generalization. One application of functional decomposition of Laurent polynomials is the functional decomposition of so-called “symbolic polynomials...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Approximation Theory
دوره 139 شماره
صفحات -
تاریخ انتشار 2006